License Plate Character Segmentation Using Hidden Markov Chains
Identifieur interne : 001281 ( Main/Exploration ); précédent : 001280; suivant : 001282License Plate Character Segmentation Using Hidden Markov Chains
Auteurs : Vojt Ch Franc [République tchèque] ; Václav Hlavá [République tchèque]Source :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2005.
Abstract
Abstract: We propose a method for segmentation of a line of characters in a noisy low resolution image of a car license plate. The Hidden Markov Chains are used to model a stochastic relation between an input image and a corresponding character segmentation. The segmentation problem is expressed as the maximum a posteriori estimation from a set of admissible segmentations. The proposed method exploits a specific prior knowledge available for the application at hand. Namely, the number of characters is known and its is also known that the characters can be segmented to sectors with equal but unknown width. The efficient algorithm for estimation based on dynamic programming is derived. The proposed method was successfully tested on data from a real life license plate recognition system.
Url:
DOI: 10.1007/11550518_48
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 002273
- to stream Istex, to step Curation: 002119
- to stream Istex, to step Checkpoint: 000B90
- to stream Main, to step Merge: 001317
- to stream Main, to step Curation: 001281
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">License Plate Character Segmentation Using Hidden Markov Chains</title><author><name sortKey="Franc, Vojt Ch" sort="Franc, Vojt Ch" uniqKey="Franc V" first="Vojt Ch" last="Franc">Vojt Ch Franc</name></author><author><name sortKey="Hlava, Vaclav" sort="Hlava, Vaclav" uniqKey="Hlava V" first="Václav" last="Hlavá">Václav Hlavá</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:A816D44B6EFADF5C0CBC761E3C38AFC6093363A9</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/11550518_48</idno><idno type="url">https://api.istex.fr/document/A816D44B6EFADF5C0CBC761E3C38AFC6093363A9/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">002273</idno><idno type="wicri:Area/Istex/Curation">002119</idno><idno type="wicri:Area/Istex/Checkpoint">000B90</idno><idno type="wicri:doubleKey">0302-9743:2005:Franc V:license:plate:character</idno><idno type="wicri:Area/Main/Merge">001317</idno><idno type="wicri:Area/Main/Curation">001281</idno><idno type="wicri:Area/Main/Exploration">001281</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">License Plate Character Segmentation Using Hidden Markov Chains</title><author><name sortKey="Franc, Vojt Ch" sort="Franc, Vojt Ch" uniqKey="Franc V" first="Vojt Ch" last="Franc">Vojt Ch Franc</name><affiliation><wicri:noCountry code="subField">University</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">République tchèque</country></affiliation></author><author><name sortKey="Hlava, Vaclav" sort="Hlava, Vaclav" uniqKey="Hlava V" first="Václav" last="Hlavá">Václav Hlavá</name><affiliation><wicri:noCountry code="subField">University</wicri:noCountry></affiliation><affiliation wicri:level="1"><country wicri:rule="url">République tchèque</country></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2005</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">A816D44B6EFADF5C0CBC761E3C38AFC6093363A9</idno><idno type="DOI">10.1007/11550518_48</idno><idno type="ChapterID">48</idno><idno type="ChapterID">Chap48</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: We propose a method for segmentation of a line of characters in a noisy low resolution image of a car license plate. The Hidden Markov Chains are used to model a stochastic relation between an input image and a corresponding character segmentation. The segmentation problem is expressed as the maximum a posteriori estimation from a set of admissible segmentations. The proposed method exploits a specific prior knowledge available for the application at hand. Namely, the number of characters is known and its is also known that the characters can be segmented to sectors with equal but unknown width. The efficient algorithm for estimation based on dynamic programming is derived. The proposed method was successfully tested on data from a real life license plate recognition system.</div></front></TEI><affiliations><list><country><li>République tchèque</li></country></list><tree><country name="République tchèque"><noRegion><name sortKey="Franc, Vojt Ch" sort="Franc, Vojt Ch" uniqKey="Franc V" first="Vojt Ch" last="Franc">Vojt Ch Franc</name></noRegion><name sortKey="Hlava, Vaclav" sort="Hlava, Vaclav" uniqKey="Hlava V" first="Václav" last="Hlavá">Václav Hlavá</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Ticri/CIDE/explor/OcrV1/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 001281 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 001281 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Ticri/CIDE
|area= OcrV1
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:A816D44B6EFADF5C0CBC761E3C38AFC6093363A9
|texte= License Plate Character Segmentation Using Hidden Markov Chains
}}
| This area was generated with Dilib version V0.6.32. |  |